package first.niuke.simple;

/**
 * @ClassName NC17
 * @description:
 * @author: 荣燊
 * @create: 2021-04-08 15:22
 **/
public class NC17 {
    //动态转移方程 P(i,j) = P(i+1,j−1)∧(Si==Sj)
    public static void main(String[] args) {
        String s = "abc1234321ab";
        int n = 12;

        System.out.println(getLongestPalindrome(s, n));
    }

    public static int getLongestPalindrome(String A, int n) {
        // write code here
        return 0;
    }
}
